A Retrospective Evaluation Method for Exact-Match and Best-Match Queries Applying an Interactive Query Performance Analyser
نویسنده
چکیده
A retrospective method for the performance comparison of queries based on different IR models is introduced. The method is based on the interactive optimisation of queries by a group of test searchers using a query performance analyser. The case experiment focused on comparing the maximum effectiveness of Boolean exact-match queries, and structured and unstructured best-match queries. The experiment verified the problems in maintaining precision of Boolean queries at high recall levels. Interesting similarities were also observed between structured and unstructured best-match queries challenging the results of earlier studies.
منابع مشابه
مدل جدیدی برای جستجوی عبارت بر اساس کمینه جابه‌جایی وزن‌دار
Finding high-quality web pages is one of the most important tasks of search engines. The relevance between the documents found and the query searched depends on the user observation and increases the complexity of ranking algorithms. The other issue is that users often explore just the first 10 to 20 results while millions of pages related to a query may exist. So search engines have to use sui...
متن کاملIndexing Multiple Sets
Index structures for multiple sets can be classified into those that group entries according to their key values and those that group entries according to their set membership. The former are particularly suited for exact match queries on all indexed sets, the latter especially support range queries on a small number of all indexed sets. The goal is to thoroughly evaluate the performance of bot...
متن کاملSemi-Automatic Evaluation via Editor-driven Taxonomies
We propose an evaluation methodology that augments traditional manual relevance judgments with automatic judgments in order to scale to evaluations over terabyte collections. Participants would submit results for a large (minimum of 2000) set of queries from a real web query log. These queries would first be paired with pseudo-relevant results using an automatic evaluation method such as matchi...
متن کاملWord Form Text Database Indexes Developing an Automatic Linguistic Truncation Operator for Best-match Retrieval of Finnish in Inflected Developing an Automatic Linguistic Truncation Operator for Best-match Retrieval of Finnish in Inflected Word Form Text Database Indexes 465
The paper presents a new method for handling of morphological variation of query terms in best-match IR. The method is based on enhanced inflectional stems. Use of inflectional stems has earlier been shown to be a good retrieval method in inflected indexes in a best-match environment for a highly inflected and compound-rich language, Finnish. In this paper the earlier stem method is elaborated ...
متن کاملSeparating indexes from data: a distributed scheme for secure database outsourcing
Database outsourcing is an idea to eliminate the burden of database management from organizations. Since data is a critical asset of organizations, preserving its privacy from outside adversary and untrusted server should be warranted. In this paper, we present a distributed scheme based on storing shares of data on different servers and separating indexes from data on a distinct server. Shamir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002